Question Relating to Prime Numbers

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Prime Slaughter: Playful Prime Numbers

Starting from the difficulty of creating playful representation of domain-specific abstract concepts, this study discusses the design of Prime Slaughter, a computer game aimed at facilitating individual sense-making of abstract mathematical concepts. Specifically the game proposes a transpositionmathematical concepts. Specifically the game proposes a transposition of primality and factorization...

متن کامل

From prime numbers to irreducible multivariate polynomials

We present several methods to produce irreducible multivariate polynomials, starting from sufficiently large prime numbers.

متن کامل

Gaps between Prime Numbers

Let dn = Pn+i ~Pn denote the nth gap in the sequence of primes. We show that for every fixed integer A; and sufficiently large T the set of limit points of the sequence {(dn/logra, ■ • • ,dn+k-i/logn)} in the cube [0, T]k has Lebesgue measure > c(k)Tk, where c(k) is a positive constant depending only on k. This generalizes a result of Ricci and answers a question of Erdös, who had asked to prov...

متن کامل

Generating Prime Numbers

A number p is prime if it is a natural number greater than 1 whose only divisors are 1 and p. The first 25 prime numbers are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97. They are quite randomly distributed among the natural numbers with no natural way of getting from one prime number to the next prime number. Each number must be tested for prim...

متن کامل

Prime-perfect Numbers

We discuss a relative of the perfect numbers for which it is possible to prove that there are infinitely many examples. Call a natural number n prime-perfect if n and σ(n) share the same set of distinct prime divisors. For example, all even perfect numbers are prime-perfect. We show that the count Nσ(x) of prime-perfect numbers in [1, x] satisfies estimates of the form exp((log x) log log log )...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 1919

ISSN: 0028-0836,1476-4687

DOI: 10.1038/103305a0